The adjunction problem over torsion-free groups
نویسندگان
چکیده
منابع مشابه
The adjunction problem over torsion-free groups.
We prove injectivity and relative asphericity for "layered" systems of equations over torsion-free groups, when the exponent matrix is invertible over Z.
متن کامل4 The adjunction problem over torsion - free groups
In this note we prove injectivity and relative asphericity for “layered” systems of equations over torsion-free groups, when the exponent matrix is invertible over Z. We also give an elementary geometric proof of a result due to Bogley–Pride and Serre that is used in the proof of the main theorem. AMS Classification 20E22, 20F05; 57M20, 57Q05
متن کامل-torsion free Acts Over Monoids
In this paper firt of all we introduce a generalization of torsion freeness of acts over monoids, called -torsion freeness. Then in section 1 of results we give some general properties and in sections 2, 3 and 4 we give a characterization of monoids for which this property of their right Rees factor, cyclic and acts in general implies some other properties, respectively.
متن کاملEquations over Torsion-free Groups Summary Klyachko's Methods and the Solution of Equations over Torsion-free Groups
SUMMARY The question we are concerned with here is the following : Let G be a torsion-free group and consider the free product Ghti of G with an innnite cyclic group (generator t). Let w be an element of Ghti?G and hhwii denote the normal closure of w in G hti, then is the natural homomorphism G ! G hti hhwii injective? Klyachko's paper : \Funny property of sphere and equations over groups" Kl]...
متن کاملThe isomorphism problem for residually torsion-free nilpotent groups
Both the conjugacy and isomorphism problems for finitely generated nilpotent groups are recursively solvable. In some recent work, the first author, with a tiny modification of work in the second author’s thesis, proved that the conjugacy problem for finitely presented, residually torsion-free nilpotent groups is recursively unsolvable. Here we complete the algorithmic picture by proving that t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the National Academy of Sciences
سال: 2005
ISSN: 0027-8424,1091-6490
DOI: 10.1073/pnas.0502940102